منابع مشابه
Learning of correlated patterns by simple perceptrons
Learning behavior of simple perceptrons is analyzed for a teacher-student scenario in which output labels are provided by a teacher network for a set of possibly correlated input patterns, and such that teacher and student networks are of the same type. Our main concern is the effect of statistical correlations among the input patterns on learning performance. For this purpose, we extend to the...
متن کاملa comparative study of language learning strategies employmed by bilinguals and monolinguals with reference to attitudes and motivation
هدف از این تحقیق بررسی برخی عوامل ادراکی واحساسی یعنی استفاده از شیوه های یادگیری زبان ، انگیزه ها ونگرش نسبت به زبان انگلیسی در رابطه با زمینه زبانی زبان آموزان می باشد. هدف بررسی این نکته بود که آیا اختلافی چشمگیر میان زبان آموزان دو زبانه و تک زبانه در میزان استفاده از شیوه های یادگیری زبان ، انگیزه ها نگرش و سطح مهارت زبانی وجود دارد. همچنین سعی شد تا بهترین و موثرترین عوامل پیش بینی کننده ...
15 صفحه اولEecient Learning of Linear Perceptrons
We introduce an eecient agnostic learning algorithm for the class of half-spaces in < n. We make no assumptions whatsoever on the example-generating distribution. Our performance guarantee is that, given any > 0, our algorithm runs in time polynomial in the sample size and dimension, and outputs a hypothesis half-space that classiies correctly at least the number of points classiied correctly w...
متن کاملLearning Sparse Perceptrons
We introduce a new algorithm designed to learn sparse perceptrons over input representations which include high-order features. Our algorithm, which is based on a hypothesis-boosting method, is able to PAC-learn a relatively natural class of target concepts. Moreover, the algorithm appears to work well in practice: on a set of three problem domains, the algorithm produces classifiers that utili...
متن کاملEfficient Learning of Linear Perceptrons
We consider the existence of efficient algorithms for learning the class of half-spaces in ~n in the agnostic learning model (Le., making no prior assumptions on the example-generating distribution). The resulting combinatorial problem finding the best agreement half-space over an input sample is NP hard to approximate to within some constant factor. We suggest a way to circumvent this theoreti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 1997
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.55.3257